Hamilton cycles in sparse locally connected graphs
نویسندگان
چکیده
منابع مشابه
Hamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
متن کاملHamilton cycles in regular 3-connected graphs
This result is best possible for k = 3 since the Petersen graph is a nonhamiltonian, 2-connected, 3-regular graph on 10 vertices. It is essentially best possible for k > 4 since there exist non-hamiltonian, 2-connected, kregular graphs on 3k + 4 vertices for k even, and 3k + 5 vertices for all k. Examples of such graphs are given in [ 1, 3 1. The problem of determining the values of k for which...
متن کاملHamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable concept of an infinite cycle. Such a concept was provided by Diestel and Kühn, who defined circles to be homeomorphic images of the unit circle in the Freudenthal compactification of the (locally finite) graph. With this...
متن کاملHamilton cycles in highly connected and expanding graphs
In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two properties: one requiring expansion of “small” sets, the other ensuring the existence of an edge between any two disjoint “large” sets. We also discuss applications in...
متن کاملHourglasses and Hamilton cycles in 4-connected claw-free graphs
We show that if G is a 4-connected claw-free graph in which every induced hourglass subgraph S contains two non-adjacent vertices with a common neighbor outside S, then G is hamiltonian. This extends the fact that 4-connected claw-free, hourglass-free graphs are hamiltonian, thus proving a broader special case of a conjecture by Matthews and Sumner.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.10.031